WCA : A Weighted Clustering Algorithm for MobileAd ho Networks
نویسندگان
چکیده
منابع مشابه
Life Time Sensitive Weighted Clustering on Wireless Sensor Networks
The present paper considers weighted clustering algorithms for mobile ad hoc networks (MANET) and wireless sensor networks (WSN). First, we summarize the similarities and differences between the two types of networks as then examine the existing weighted clustering algorithms proposed so far. We specifically examine the objective functions and performances of the algorithm in terms of various p...
متن کاملGenetic Algorithm Based Optimization of Clustering in Ad Hoc Networks
In this paper, we have to concentrate on implementation of Weighted Clustering Algorithm with the help of Genetic Algorithm (GA).Here we have developed new algorithm for the implementation of GA-based approach with the help of Weighted Clustering Algorithm (WCA) [4]. Cluster-Head chosen is a important thing for clustering in ad-hoc networks. So, we have shown the optimization technique for the ...
متن کاملEnergy Efficient Weighted Clustering Algorithm in Wireless Sensor Networks
With the advancement in communication and internet technologies, recently there have been many research efforts in the area of Wireless Sensor Networks (WSNs) to conserve energy. Clustering mechanisms have been applied to WSNs to enhance the network performance while reducing the necessary energy consumption. The goal of Weighted Clustering Algorithm (WCA) is to determine the cluster heads dyna...
متن کاملNew Strategies and Extensions in Weighted Clustering Algorithms for Mobile Ad Hoc Networks
We study the problem of constructing a novel framework for dynamically organizing mobile nodes in wireless ad-hoc networks into clusters where it is necessary to provide robustness in the face of topological changes caused by node motion, node failure and node insertion/removal. The main contribution of our work is a new strategy for clustering a wireless AD HOC network and improvements in WCA ...
متن کاملOptimizing clustering algorithm in mobile ad hoc networks using simulated annealing
In this paper, we demonstrate how simulated annealing algorithm can be applied to clustering algorithms used in ad hoc networks; specifically our recently proposed weighted clustering algorithm(WCA) is optimized by simulated annealing. As the simulated annealing stands to be a powerful stochastic search method, its usage for combinatorial optimization problems was found to be applicable in our ...
متن کامل